t=int(input())
for x in range(t):
inp=list(map(int,input().split()))
n=inp[0]
m=inp[1]
wall=[]
operations=[]
for y in range(n):
p=input()
wall.append(p)
if(wall[0][0]=='1'):
print(-1)
continue
for y in range(n):
for z in range(m):
p=[]
if(wall[y][m-z-1]=='1'):
if(m-z!=1):
operations.append((y+1,m-z-1,y+1,m-z))
for y in range(n):
if(wall[n-y-1][0]=='1'):
operations.append((n-y-1,1,n-y,1))
print(len(operations))
for x in operations:
print(x[0],x[1],x[2],x[3])#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
long long n , m;
cin>>n>>m;
vector<string > v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
if(v[0][0]=='1'){
cout<<-1<<endl;
continue;
}
vector<vector<int >> ans;
for(int i=n-1;i >= 0;i--){
for(int j=m-1;j >= 0;j--){
if(v[i][j]=='1'){
vector<int> temp;
if(j!=0){
temp.push_back(i+1);
temp.push_back(j);
temp.push_back(i+1);
temp.push_back(j+1);
}
else{
temp.push_back(i);
temp.push_back(j+1);
temp.push_back(i+1);
temp.push_back(j+1);
}
ans.push_back(temp);
}
}
}
long long s = ans.size();
cout<<s<<endl;
for(long long i = 0;i<s;i++){
for(int j =0;j<4;j++){
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
}
}1716A - 2-3 Moves | 1670B - Dorms War |
1716B - Permutation Chain | 987A - Infinity Gauntlet |
1676G - White-Black Balanced Subtrees | 1716D - Chip Move |
1352F - Binary String Reconstruction | 1487B - Cat Cycle |
1679C - Rooks Defenders | 56A - Bar |
1694B - Paranoid String | 35A - Shell Game |
1684A - Digit Minimization | 43B - Letter |
1017A - The Rank | 1698B - Rising Sand |
235A - LCM Challenge | 1075B - Taxi drivers and Lyft |
1562A - The Miracle and the Sleeper | 1216A - Prefixes |
1490C - Sum of Cubes | 868A - Bark to Unlock |
873B - Balanced Substring | 1401D - Maximum Distributed Tree |
1716C - Robot in a Hallway | 1688B - Patchouli's Magical Talisman |
99A - Help Far Away Kingdom | 622B - The Time |
1688C - Manipulating History | 1169D - Good Triple |